Frege ' s Theorem : An Introduction
نویسنده
چکیده
1. Opening w HAT IS T H E EPISTEMOLOGICAL STATUS O F O U R KNOWledge of the truths of arithmetic? Are they analytic, the products of pure reason, as Leibniz held? O r are they high-level empirical truths that we know only a posteviori, as some empiricists, particularly Mill, have held? O r was Kant right to say that, although our lulowledge that '5+7=12' depends essentially upon intuition, it is nonetheless a pviori? I t was with this problem that Gottlob Frege was chiefly concerned throughout his philosophical career. His goal was to establish a version of Leibniz's vie\\ (and so to demonstrate the independence of arithmetical and geometrical reasoning), to show that the truths of arithmetic follow logically from premises which are themselves truths of logic. I t is this view that we now call Lotjicism. Frege's approach to this problem had a number of strands, but it is simplest to divide it into two: a negative part and a positive part. The negative part consists of criticisms of the views of Mill and Kant, and others who share them. These criticisms, although they are found in a variety of places, mostly occur in the first three chapters of Die Grundlatjen der Avithmetik.' The positive part consists of an attempt to show (not just that but) how arithmetical truths can be established by pure reason, by actually giving proofs of them from premises which are (or are supposed to be) truths of pure logic. There is thus a purely mathematical aspect of Frege's project: it is this on which I intend to focus here. Frege was not the first t o attempt to show how arithmetical truths can be proven from more fundamental assumptions. His approach, however, was more rigorous and encompassing, by far, than anything that had come before. Leibniz, for example, had attempted to prove such arithmetical truths as "2+2=4." His proofs, however, like those of Euclid before him, rest upon assumptions that he does not make explicit: for esample, Leibniz make free appeal to the associative law of addition, which says that (a+b)+c = a+(b+c), i.e., allows himself freely to "re-arrange" parentheses. But it is essential to any attempt to determine the epistemological status of the laws of arithmetic that we be able precisely to determine upon what
منابع مشابه
Are there Hard Examples for Frege Systems?
It is generally conjectured that there is an exponential separation between Frege and extended Frege systems. This paper reviews and introduces some candidates for families of combinatorial tautologies for which Frege proofs might need to be superpolynomially longer than extended Frege proofs. Surprisingly, we conclude that no particularly good or convincing examples are known. The examples of ...
متن کاملQuasipolynomial Size Frege Proofs of Frankl's Theorem on the Trace of Sets
We extend results of Bonet, Buss and Pitassi on Bondy’s Theorem and of Nozaki, Arai and Arai on Bollobás’ Theorem by proving that Frankl’s Theorem on the trace of sets has quasipolynomial size Frege proofs. For constant values of the parameter t, we prove that Frankl’s Theorem has polynomial size AC-Frege proofs from instances of the pigeonhole principle. §
متن کاملTractability of Cut-Free Gentzen Type Propositional Calculus with Permutation Inference
In Arai (1996), we introduced a new inference rule called permutation to propositional calculus and showed that cut-free Gentzen system LK (GCNF) with permutation (1) satis es the feasible subformula property, and (2) proves pigeonhole principle and k-equipartition polynomially. In this paper, we survey more properties of our system. First, we prove that cut-free LK + permutation has polynomial...
متن کاملShort Proofs of the Kneser-Lovász Coloring Principle
We prove that the propositional translations of the KneserLovász theorem have polynomial size extended Frege proofs and quasipolynomial size Frege proofs. We present a new counting-based combinatorial proof of the Kneser-Lovász theorem that avoids the topological arguments of prior proofs. We introduce a miniaturization of the octahedral Tucker lemma, called the truncated Tucker lemma. The prop...
متن کاملOn the Deduction Theorem and Complete Disjoint NP-Pairs
In this paper we ask the question whether the extended Frege proof system EF satisfies a weak version of the deduction theorem. We prove that if this is the case, then complete disjoint NP-pairs exist. On the other hand, if EF is an optimal proof system, then the weak deduction theorem holds for EF . Hence the weak deduction property for EF is a natural intermediate condition between the optima...
متن کاملProof Complexity and the Kneser-Lovász Theorem (I)
We investigate the proof complexity of a class of propositional formulas expressing a combinatorial principle known as the KneserLovász Theorem. This is a family of propositional tautologies, indexed by an nonnegative integer parameter k that generalizes the Pigeonhole Principle (obtained for k = 1). We show, for all fixed k, 2Ω(n) lower bounds on resolution complexity and exponential lower bou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004